Continuous and discrete least-squares approximation by radial basis functions on spheres
نویسندگان
چکیده
منابع مشابه
Continuous and discrete least-squares approximation by radial basis functions on spheres
In this paper we discuss Sobolev bounds on functions that vanish at scattered points on the n-sphereSn in Rn+1. The Sobolev spaces involved may have fractional as well as integer order.We then apply these results to obtain estimates for continuous and discrete least-squares surface fits via radial basis functions (RBFs). We also address a stabilization or regularization technique known as splin...
متن کاملOrthogonal basis functions in discrete least squares rational approximation
We consider a problem that arises in the field of frequency domain system identification. If a discrete-time system has an input-output relation Y (z) = G(z)U(z), with transfer function G, then the problem is to find a rational approximation Ĝn for G. The data given are measurements of input and output spectra in the frequency points zk: {U(zk), Y (zk)}k=1 together with some weight. The approxi...
متن کاملUniform approximation by discrete least squares polynomials
We study uniform approximation of differentiable or analytic functions of one or several variables on a compact set K by a sequence of discrete least squares polynomials. In particular, if K satisfies a Markov inequality and we use point evaluations on standard discretization grids with the number of points growing polynomially in the degree, these polynomials provide nearly optimal approximant...
متن کاملDiscrete Least Squares Approximation by Trigonometric Polynomials
We present an efficient and reliable algorithm for discrete least squares approximation of a real-valued function given at arbitrary distinct nodes in [0, 2tt) by trigonometric polynomials. The algorithm is based on a scheme for the solution of an inverse eigenproblem for unitary Hessenberg matrices, and requires only O(mn) arithmetic operations as compared with 0(mn ) operations needed for alg...
متن کاملA least-squares preconditioner for radial basis functions collocation methods
Although meshless radial basis function (RBF) methods applied to partial differential equations (PDEs) are not only simple to implement and enjoy exponential convergence rates as compared to standard mesh-based schemes, the system of equations required to find the expansion coefficients are typically badly conditioned and expensive using the global Gaussian elimination (G-GE) method requiring O...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Approximation Theory
سال: 2006
ISSN: 0021-9045
DOI: 10.1016/j.jat.2006.03.007